Generic ILP-Based Approaches for Dynamically Reconfigurable FPGA Partitioning
نویسندگان
چکیده
Due to the precedence constraints among vertices, the partitioning problem for dynamically reconfigurable FPGAs (DRFPGAs) is different from the traditional one. In this paper, we first derive logic formulations for the precedence-constrained partitioning problems, and then transform the formulations into integer linear programs (ILPs). The ILPs can handle the precedence constraints and minimize cut sizes simultaneously. To enhance performance, we also propose a clustering method to reduce the problem size. Experimental results based on the Xilinx DRFPGA architecture show that our approach outperforms the list scheduling (List), the network flow based (FBB-m) [14], and the probability based (PAT) [6] methods by respective average improvements of 46.6%, 32.3%, and 21.5% in cut sizes. Our approach is practical and scales well to larger problems; the empirical runtime grows close to linearly in the circuit size. More importantly, our approach is very flexible and can readily extend to the partitioning problems with various objectives and constraints, which makes the ILP formulations superior alternatives to the DRFPGA partitioning problems.
منابع مشابه
A Methodology for Task Based Partitioning and Scheduling of Dynamically Reconfigurable Systems
The paper presents a methodology for designing dynamic reconngurable systems that optimally overlaps execution and reconnguration so as to maximize performance. Partitioning and dynamic reconnguration scheduling approaches are proposed and discussed in detail. Practical issues, including the need for limiting the number of diierent conngurations that ought to be dynamically placed and routed in...
متن کاملReduced Communication Costs via Network Flow and Scheduling for Partitions of Dynamically Reconfigurable FPGAs
This paper presents a dynamically reconfigurable FPGA partitioning algorithm for netlist-level circuits. The proposed algorithm combines traditional max-flow min-cut computing with a scheduling mechanism to improve maximum communication costs. Application of our previously published scheduling mechanism [19] to partitioning of sequential circuits can induce problems regarding the crossing of cu...
متن کاملAn Enhanced Network Flow Algorithm for Temporal Partitioning into Reconfigurable Architectures
In this paper, we present a novel temporal partitioning methodology for dynamically reconfigurable computing systems to reduce the communication costs of the design. This aim can be reached by minimizing the transfer of data required between design partitions. Our algorithm use the network flow-based multi-way task partitioning algorithm to minimize communication costs for temporal partitioning...
متن کاملDynamic and On-Line Design Space Exploration for Reconfigurable Architectures
The implementation of complex embedded applications requires a mix of processor cores and HW accelerators on a single chip. When designing such complex and heterogeneous System on Chip (SoCs), the HW/SW partitioning needs to be made prior to refining the system description. Traditional system partitioning is generally done at the early stage of system architecture, by defining the tasks to be i...
متن کاملTROUTE: A Reconfigurability-Aware FPGA Router
Since FPGAs are inherently reconfigurable, making FPGA designs generic does not reduce chip cost, as is the case for ASICs. However, designing and mapping lots of specialized FPGA designs introduces an extra EDA cost. We describe a two staged fully automatic FPGA tool flow that efficiently maps a generic HDL design to multiple specialized FPGA configurations. The mapping is fast enough to be ex...
متن کامل